Robust Optimization of Energy-Saving Train Trajectories Under Passenger Load Uncertainty Based on p-NSGA-II
نویسندگان
چکیده
Railway electrification has attracted substantial interest in recent years as a key part of the global effort to achieve transport decarbonization. To improve energy efficiency train operations, particular is optimization speed trajectories. However, most studies formulate problem single-objective model and do not take into account mass uncertainty associated with passenger load variations. This article formulates biobjective robust minimize both consumption journey time, which robustness against uncertain considered viewed decision-maker preference. A novel multiobjective algorithm, namely, p-nondominated sorting genetic algorithm-II (NSGA-II), proposed, incorporating original NSGA-II proposed preference dominance criterion handle DM With p-NSGA-II, only all solutions will converge optimal Pareto front but also better be automatically selected retained; meanwhile, spread maintained. The effectiveness p-NSGA-II generate set performance-robust driving schemes verified by numerical case studies. results show that can up 40.59% improvement compared NSGA-II.
منابع مشابه
Robust optimization under multiband uncertainty
We provide an overview of the main results that we obtained studying uncertain mixed integer linear programs when the uncertainty is represented through the new multiband model [4]. Such model extends and refines the classical one proposed by Bertsimas and Sim [2] and is particularly suitable in the common case of arbitrary non-symmetric distributions of the uncertainty. Our investigations were...
متن کاملRobustness-based portfolio optimization under epistemic uncertainty
In this paper, we propose formulations and algorithms for robust portfolio optimization under both aleatory uncertainty (i.e., natural variability) and epistemic uncertainty (i.e., imprecise probabilistic information) arising from interval data. Epistemic uncertainty is represented using two approaches: (1) moment bounding approach and (2) likelihood-based approach. This paper first proposes a ...
متن کاملOn the approximability of adjustable robust convex optimization under uncertainty
In this paper, we consider adjustable robust versions of convex optimization problems with uncertain constraints and objectives and show that under fairly general assumptions, a static robust solution provides a good approximation for these adjustable robust problems. An adjustable robust optimization problem is usually intractable since it requires to compute a solution for all possible realiz...
متن کاملOptions for Robust Airfoil Optimization under Uncertainty
A robust optimization method is developed to overcome point-optimization at the sampled design points. This method combines the best features from several preliminary methods proposed by the authors and their colleagues. The robust airfoil shape optimization is a direct method for drag reduction over a given range of operating conditions and has three advantages: (1) it prevents severe degradat...
متن کاملRobust Combinatorial Optimization under Budgeted-Ellipsoidal Uncertainty∗
In the field of robust optimization uncertain data is modeled by uncertainty sets, i.e. sets which contain all relevant outcomes of the uncertain parameters. The complexity of the related robust problem depends strongly on the shape of the uncertainty set. Two popular classes of uncertainty are budgeted uncertainty and ellipsoidal uncertainty. In this paper we introduce a new uncertainty class ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Transportation Electrification
سال: 2023
ISSN: ['2577-4212', '2372-2088', '2332-7782']
DOI: https://doi.org/10.1109/tte.2022.3194698